Differential-algebraic Dynamic Logic for Differential-algebraic Programs
نویسندگان
چکیده
منابع مشابه
Differential-algebraic Dynamic Logic for Differential-algebraic Programs
We generalise dynamic logic to a logic for differential-algebraic programs, i.e., discrete programs augmented with first-order differentialalgebraic formulas as continuous evolution constraints in addition to first-order discrete jump formulas. These programs characterise interacting discrete and continuous dynamics of hybrid systems elegantly and uniformly. For our logic, we introduce a calcul...
متن کاملAN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملIndex reduction of differential algebraic equations by differential algebraic elimination
High index differential algebraic equations (DAEs) are ordinary differential equations (ODEs) with constraints and arise frequently from many mathematical models of physical phenomenons and engineering fields. In this paper, we generalize the idea of differential elimination with Dixon resultant to polynomially nonlinear DAEs. We propose a new algorithm for index reduction of DAEs and establish...
متن کاملEmbedding Differential Algebraic Groups in Algebraic Groups
Quantifier Elimination We work in K a large rich differentially closed field. All other differential fields are assumed to be small subfields of K. Let L = {+,−, ·, δ, 0, 1} be the language of differential rings. We let L− = {+,−, ·, 0, 1}, the language of rings. If k is a differential field, we can view k either as an L-structure or an L−-structure. Theorem 1.1 (Quantifier Elimination) For any...
متن کاملA Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2008
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exn070